Search results for "Boolean algebra"
showing 10 items of 17 documents
Compound conditionals as random quantities and Boolean algebras
2022
Conditionals play a key role in different areas of logic and probabilistic reasoning, and they have been studied and formalised from different angles. In this paper we focus on the de Finetti's notion of conditional as a three-valued object, with betting-based semantics, and its related approach as random quantity as mainly developed by two of the authors. Compound conditionals have been studied in the literature, but not in full generality. In this paper we provide a natural procedure to explicitly attach conditional random quantities to arbitrary compound conditionals that also allows us to compute their previsions. By studying the properties of these random quantities, we show that, in f…
Forcing for First-Order Languages from the Perspective of Rasiowa–Sikorski Lemma
2017
The paper is concerned with the problem of building models for first-order languages from the perspective of the classic paper of Rasiowa and Sikorski [9]. The central idea, developed in this paper, consists in constructing first-order models from individual variables. The key notion of a Rasiowa–Sikorski set of formulas for an arbitrary countable language L is examined. Each Rasiowa–Sikorski set defines a countable model for L . Conversely, every countable model for L is determined by a Rasiowa–Sikorski set. The focus is on constructing Rasiowa–Sikorski sets by applying forcing techniques restricted to Boolean algebras arising from the subsets of the set of atomic formulas of L .
Conditioning on MV-algebras and additive measures —I
1997
Abstract We present a lattice-ordered semigroup approach for the foundation of conditional events which covers the special situations where the underlying (unconditional) events are Boolean or fuzzy, respectively. Our proposal is quite different from other, ring theoretical, approaches. The problem of extending additivity of uncertainty measures from unconditional to conditional events will be discussed.
On Conditioning Operators
1999
The construction of conditional events (so-called measure-free conditioning) has a long history and is one of the fundamental problems in non-deterministic system theory (cf. [6]). In particular, the iteration of measure-free conditioning is still an open problem. The present paper tries to make a contribution to this question. In particular, we give an axiomatic introduction of conditioning operators which act as binary operations on the universe of events. The corresponding axiom system of this type of operators focus special attention on the intuitive understanding that the event ‘α given β’ is somewhere in “between” ‘α and β’ and ‘β implies α’. A detailed motivation of these axioms can …
Analysis of Spatially and Temporally Overlapping Events with Application to Image Sequences
2006
Counting spatially and temporally overlapping events in image sequences and estimating their shape-size and duration features are important issues in some applications. We propose a stochastic model, a particular case of the nonisotropic 3D Boolean model, for performing this analysis: the temporal Boolean model. Some probabilistic properties are derived and a methodology for parameter estimation from time-lapse image sequences is proposed using an explicit treatment of the temporal dimension. We estimate the mean number of germs per unit area and time, the mean grain size and the duration distribution. A wide simulation study in order to assess the proposed estimators showed promising resul…
Pseudocomplements in sum-ordered partial semirings
2007
We study a particular way of introducing pseudocomplementation in ordered semigroups with zero, and characterise the class of those pseudocomplemented semigroups, termed g-semigroups here, that admit a Glivenko type theorem (the pseudocomplements form a Boolean algebra). Some further results are obtained for g-semirings – those sum-ordered partially additive semirings whose multiplicative part is a g-semigroup. In particular, we introduce the notion of a partial Stone semiring and show that several well-known elementary characteristics of Stone algebras have analogues for such semirings.
Didactical note: probabilistic conditionality in a Boolean algebra
1996
This note deals with two logical topics and concerns Boolean Algebras from an elementary point of view. First we consider the class of operations on a Boolean Algebra that can be used for modelling ``If-then" propositions. These operations, or Conditionals, are characterized under the hypothesis that they only obey to the Modus Ponens-Inequality, and it is shown that only six of them are boolean two-place functions. Is the Conditional Probability the Probability of a Conditional? This problem will be only considered, with the Material Conditional Operation, on a Boolean Algebra endowed with a finite probability and in three different cases: with the Internal-Conditional Probability, with th…
On conditional probabilities and their canonical extensions to Boolean algebras of compound conditionals
2023
In this paper we investigate canonical extensions of conditional probabilities to Boolean algebras of conditionals. Before entering into the probabilistic setting, we first prove that the lattice order relation of every Boolean algebra of conditionals can be characterized in terms of the well-known order relation given by Goodman and Nguyen. Then, as an interesting methodological tool, we show that canonical extensions behave well with respect to conditional subalgebras. As a consequence, we prove that a canonical extension and its original conditional probability agree on basic conditionals. Moreover, we verify that the probability of conjunctions and disjunctions of conditionals in a rece…
Rough Set Algebras as Description Domains
2009
Study of the so called knowledge ordering of rough sets was initiated by V.W. Marek and M. Truszczynski at the end of 90-ies. Under this ordering, the rough sets of a fixed approximation space form a domain in which every set ↓ is a Boolean algebra. In the paper, an additional operation inversion on rough set domains is introduced and an abstract axiomatic description of obtained algebras of rough set is given. It is shown that the resulting class of algebras is essentially different from those traditional in rough set theory: it is not definable, for instance, in the class of regular double Stone algebras, and conversely.
The overlap algebra of regular opens
2010
Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …